public class Day6 {

    public static int firstBadVersion(int n) {

        int front = 0;
        int tail = n;
        int mid = front + (tail - front) / 2;
        //ss
        while (true) {

        }

    }

    public static void main(String[] args) {

    }

    public static int searchInsert(int[] nums, int target) {
        int i = 0;
        for (; i < nums.length; i++) {
            if (target <= nums[i]) {
                return i;
            }
        }
        return i;
    }

}
